On the metric dimension of convex polytopes ∗
نویسندگان
چکیده
Metric dimension is a generalization of affine dimension to arbitrary metric spaces (provided a resolving set exists). Let F be a family of connected graphs Gn : F = (Gn)n≥1 depending on n as follows: the order |V (G)| = φ(n) and lim n→∞ φ(n) = ∞ . If there exists a constant C > 0 such that dim(Gn) ≤ C for every n ≥ 1 then we shall say that F has bounded metric dimension. If all graphs in F have the same metric dimension (which does not depend on n ), F is called a family with constant metric dimension. In this paper, we study the properties of of some classes of convex polytopes having pendent edges with respect to their metric dimension.
منابع مشابه
On the metric dimension of rotationally-symmetric convex polytopes∗
Metric dimension is a generalization of affine dimension to arbitrary metric spaces (provided a resolving set exists). Let F be a family of connected graphs Gn : F = (Gn)n ≥ 1 depending on n as follows: the order |V (G)| = φ(n) and lim n→∞ φ(n) = ∞. If there exists a constant C > 0 such that dim(Gn) ≤ C for every n ≥ 1 then we shall say that F has bounded metric dimension, otherwise F has unbou...
متن کاملThe Lower Bound Theorem for polytopes that approximate C-convex bodies
The face numbers of simplicial polytopes that approximate C-convex bodies in the Hausdorff metric is studied. Several structural results about the skeleta of such polytopes are studied and used to derive a lower bound theorem for this class of polytopes. This partially resolves a conjecture made by Kalai in 1994: if a sequence {Pn}n=0 of simplicial polytopes converges to a C-convex body in the ...
متن کاملClassification of Finite Metric Spaces and Combinatorics of Convex Polytopes
We describe the canonical correspondence between finite metric spaces and symmetric convex polytopes, and formulate the problem about classification of the metric spaces in terms of combinatorial structure of those polytopes.
متن کاملOn Topology of G-Configuration Spaces of Polyhedra
The family P of all convex 3-polytopes P in Euclidean space E 3 may be partitioned into combinatorial types or configuration spaces by isomorphism of face lattices , and the configuration space [ ] P of any such 3-polytope P may be subdivided further into GConfiguration space P by equivalence of actions of symmetry group ) (P G on face lattices. With respect to a natural topology induced by Hau...
متن کاملEhrhart polynomials of convex polytopes with small volumes
Let P ⊂ R be an integral convex polytope of dimension d and δ(P) = (δ0, δ1, . . . , δd) be its δ-vector. By using the known inequalities on δ-vectors, we classify the possible δ-vectors of convex polytopes of dimension d with P
متن کامل